Packing anchored rectangles
نویسندگان
چکیده
Let S be a set of n points in the unit square [0, 1], one of which is the origin. We construct n pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in S, and the rectangles jointly cover at least a positive constant area (about 0.09). This is a first step towards the solution of a longstanding conjecture that the rectangles in such a packing can jointly cover an area of at least 1/2.
منابع مشابه
Packing Boundary-Anchored Rectangles
In this paper, we study the boundary-anchored rectangle packing problem in which we are given a set P of points on the boundary of an axis-aligned squareQ. The goal is to find a set of disjoint axis-aligned rectangles in Q such that each rectangle is anchored at some point in P , each point in P is used to anchor at most one rectangle, and the total area of the rectangles is maximized. We show ...
متن کاملAnchored Rectangle and Square Packings
For points p1, . . . , pn in the unit square [0, 1] , an anchored rectangle packing consists of interior-disjoint axis-aligned empty rectangles r1, . . . , rn ⊆ [0, 1] such that point pi is a corner of the rectangle ri (that is, ri is anchored at pi) for i = 1, . . . , n. We show that for every set of n points in [0, 1], there is an anchored rectangle packing of area at least 7/12 − O(1/n), and...
متن کاملOn Packing Almost Half of a Square with Anchored Rectangles: A Constructive Approach
In this paper, we consider the following geometric puzzle whose origin was traced to Allan Freedman [13, 22] in the 1960s by Dumitrescu and Tóth [10]. The puzzle has been popularized of late by Peter Winkler [23]. Let Pn be a set of n points, including the origin, in the unit square U = [0, 1] . The problem is to construct n axis-parallel and mutually disjoint rectangles inside U such that the ...
متن کاملA THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM
The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...
متن کاملChips on wafers, or packing rectangles into grids
A set of rectangles S is said to be grid packed if there exists a rectangular grid (not necessarily regular) such that every rectangle lies in the grid and there is at most one rectangle of S in each cell. The area of a grid packing is the area of a minimal bounding box that contains all the rectangles in the grid packing. We present an approximation algorithm that given a set S of rectangles a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 35 شماره
صفحات -
تاریخ انتشار 2012